Width of SL(<i>n</i>,
نویسندگان
چکیده
We give an estimate for the width of congruence subgroup SL(n,OS,I) in Tits–Vaserstein generators, where OS is a localization ring integers number field K. assume that either K has real embedding, or ideal I prime to roots unity
منابع مشابه
Width invariant approximation of fuzzy numbers
In this paper, we consider the width invariant trapezoidal and triangularapproximations of fuzzy numbers. The presented methods avoid the effortful computation of Karush-Kuhn-Tucker Theorem. Some properties of the new approximation methods are presented and the applicability of the methods is illustrated by examples. In addition, we show that the proposed approximations of fuzzy numbers preserv...
متن کاملThe NLC-width and clique-width for powers of graphs of bounded tree-width
The k-power graph of a graph G is a graphwith the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-treepower graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree. We show that (1) every k-tree-power graph has NLC-width at most k + 2...
متن کاملApproximating clique-width and branch-width
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph “clique-width”. Clique-width is a measure of the difficulty of decomposing a graph in a kind of tree-structure, and if a graph has clique-width at most k then the corresponding decomposition of the graph is called a “k-expression”. ...
متن کاملPetal Width, Cm Petal Width, Cm
There are several reasons why this book might be of interest to a TEX user. First, LTEX has a prominent place in the book. Second, the book describes a very interesting offshoot of literate programming, a topic traditionally popular in the TEX community. Third, since a number of TEX users work with data analysis and statistics, R could be a useful tool for them. Since some TUGboat readers are l...
متن کاملK.Khadiev WIDTH HIERARCHY FOR K-OBDD OF SMALL WIDTH
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2022
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2022.2139953